A factorization criterion for acyclic directed mixed graphs
نویسنده
چکیده
Acyclic directed mixed graphs, also known as semi-Markov models represent the conditional independence structure induced on an observed margin by a DAG model with latent variables. In this paper we present a factorization criterion for these models that is equivalent to the global Markov property given by (the natural extension of) dseparation.
منابع مشابه
Nested Markov Properties for Acyclic Directed Mixed Graphs
Directed acyclic graph (DAG) models may be characterized in four different ways: via a factorization, the dseparation criterion, the moralization criterion, and the local Markov property. As pointed out by Robins [2, 1], Verma and Pearl [6], and Tian and Pearl [5], marginals of DAG models also imply equality constraints that are not conditional independences. The well-known ‘Verma constraint’ i...
متن کاملMarkov Properties for Acyclic Directed Mixed Graphs
We consider acyclic directed mixed graphs, in which directed edges (x → y) and bi-directed edges (x ↔ y) may occur. A simple extension of Pearl’s d-separation criterion, called m-separation, is applied to these graphs. We introduce a local Markov property which is equivalent to the global property resulting from the m-separation criterion.
متن کاملStable Mixed Graphs
In this paper we study classes of graphs with three types of edges that capture the modified independence structure of a directed acyclic graph (DAG) after marginalisation over unobserved variables and conditioning on selection variables using the m-separation criterion. These include MC, summary, and ancestral graphs. As a modification of MC graphs we define the class of ribbonless graphs (RGs...
متن کاملTrek Separation for Gaussian Graphical Models
Gaussian graphical models are semi-algebraic subsets of the cone of positive definite covariance matrices. Submatrices with low rank correspond to generalizations of conditional independence constraints on collections of random variables. We give a precise graph-theoretic characterization of when submatrices of the covariance matrix have small rank for a general class of mixed graphs that inclu...
متن کاملAn Efficient Algorithm for Computing Interventional Distributions in Latent Variable Causal Models
Probabilistic inference in graphical models is the task of computing marginal and conditional densities of interest from a factorized representation of a joint probability distribution. Inference algorithms such as variable elimination and belief propagation take advantage of constraints embedded in this factorization to compute such densities efficiently. In this paper, we propose an algorithm...
متن کامل